Cone: A Distributed Heap Approach to Resource Selection

نویسندگان

  • Ranjita Bhagwan
  • Priya Mahadevan
  • George Varghese
  • Geoffrey M. Voelker
چکیده

In this paper, we propose a new distributed heap-based data structure called Cone. Cone maintains an ordering of key values in a distributed fashion, and can support queries of the form, “Find resources of size .” Cone can be built on any routing substrate as long as the substrate supports longest prefix match-based lookups. We describe the Cone data structure, the operations it supports, and its load balancing properties. We have implemented and evaluated Cone on a 1000-node ModelNet emulation platform and a 50-node PlanetLab distributed testbed. We show that Cone has good load-balancing properties and that it is stable and reactive even when there is considerable amount of dynamism in the system.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cone: Augmenting DHTs to Support Distributed Resource Discovery

Together with the revolution in peer-to-peer content sharing, as exemplified by Napster and Gnutella, there has been a parallel revolution in peer-to-peer distributed computing as exemplified by SETI@home and Javelin. As with content sharing, P2P computing networks have evolved from centralized to distributed resource discovery. Thus a fundamental problem in P2P computing is to scalably answer ...

متن کامل

A Fuzzy Decision Making Approach to Enterprise Resource Planning System Selection

Here, we propose a fuzzy analytic hierarchy process (FAHP) method to evaluate the alternatives of enterprise resource planning (ERP) system. The fuzzy AHP approach allows the users get values more accurately to model the vagueness which changes according subjective ideas in the decision-making environment for ERP system selection problem. Therefore, fuzzy AHP method is used to obtain firm decis...

متن کامل

Does Selective Search Benefit from WAND Optimization?

Selective search is a distributed retrieval technique that reduces the computational cost of large-scale information retrieval. By partitioning the collection into topical shards, and using a resource selection algorithm to identify a subset of shards to search, selective search allows retrieval effectiveness to be maintained while evaluating fewer postings, often resulting in 90+% reductions i...

متن کامل

A New Analytical Solution for Determination of Acceptable Overall settlement of Heap Leaching Structures Foundation

There are some artificial and natural materials on foundation of heap leaching structures. Geomembrane liner is the most important artificial isolated layer of these structures. The thickness of this layer is about 1 to 2 mm. Foundation overall settlement of such structures changes the primary length of the geomembrane layer. If the strain of geomembrane is more than allowable one, the layer wi...

متن کامل

An Agent Based Dynamic Resource Scheduling Model with FCFS-Job Grouping Strategy in Grid Computing

Grid computing is a group of clusters connected over high-speed networks that involves coordinating and sharing computational power, data storage and network resources operating across dynamic and geographically dispersed locations. Resource management and job scheduling are critical tasks in grid computing. Resource selection becomes challenging due to heterogeneity and dynamic availability of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004